Hyperbolic Random Graphs: Separators and Treewidth

Hyperbolic random graphs share many common properties with complex real-world networks; e.g., small diameter and average distance, large clustering coefficient, and a power-law degree sequence with adjustable exponent β. Thus, when analyzing algorithms for large networks, potentially more realistic results can be achieved by assuming the input to be a hyperbolic random graph of size n. The worst-case run-time is then replaced by the expected run-time or by bounds that hold with high probability (whp), i.e., with probability 1−O(1/n). Though many structural properties of hyperbolic random graphs have been studied, almost no algorithmic results are known. Divide-and-conquer is an important algorithmic design principle that works particularly well if the instance admits small separators. We show that hyperbolic random graphs in fact have comparatively small separators. More precisely, we show that they can be expected to have balanced separator hierarchies with separators of size O( √ n3−β), O(logn), and O(1) if 2 < β < 3, β = 3, and 3 < β, respectively. We infer that these graphs have whp a treewidth of O( √ n3−β), O(log2 n), and O(logn), respectively. For 2 < β < 3, this matches a known lower bound. To demonstrate the usefulness of our results, we give several algorithmic applications. 1998 ACM Subject Classification G.2.1 Combinatorics, F.2.2 Nonnumerical Algorithms and Problems